Fast Inverse using Nested Dissection for NEGF
نویسندگان
چکیده
An accurate and efficient algorithm for computing non-equilibrium Green’s functions has been developed and used in the simulations of a novel nanoscale MOSFET device structure. The method is based on the principle of nested dissection and demonstrates significant performance improvement from both speed and memory requirements points of view as compared to the state of the art recursive Green’s function approach.
منابع مشابه
Finding off-diagonal entries of the inverse of a large symmetric sparse matrix
The method fast inverse using nested dissection (FIND) was proposed to calculate the diagonal entries of the inverse of a large sparse symmetric matrix. In this paper, we show how the FIND algorithm can be generalized to calculate off-diagonal entries of the inverse that correspond to ‘short’ geometric distances within the computational mesh of the original matrix. The idea is to extend the dow...
متن کاملComplete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملA fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
Article history: Received 18 July 2012 Received in revised form 21 September 2013 Accepted 17 October 2013 Available online 24 October 2013
متن کاملH-Matrix-Based Fast Direct Finite Element Solver for Large-Scale Electromagnetic Analysis
In this work, we prove that the sparse matrix resulting from a finite-element-based analysis of electrodynamic problems can be represented by an -matrix without any approximation, and the inverse of this sparse matrix has a data-sparse matrix approximation with error well controlled. Based on this proof, we develop an -matrix-based direct finite-element solver of O(kNlogN) memory complexity ...
متن کاملThe Inverse Fast Multipole Method
This article introduces a new fast direct solver for linear systems arising out of wide range of applications, integral equations, multivariate statistics, radial basis interpolation, etc., to name a few. The highlight of this new fast direct solver is that the solver scales linearly in the number of unknowns in all dimensions. The solver, termed as Inverse Fast Multipole Method (abbreviated as...
متن کامل